Circular Languages Generated by Complete Splicing Systems and Pure Unitary Languages

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Circular languages generated by complete splicing systems and pure unitary languages ( extended version ) ⋆

Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA. Some unanswered questions are related to the computational power of such systems, and finding a characterization of the class of circular languages generated by circular splicing systems is still an open problem. In this paper we solve this problem for c...

متن کامل

Circular Languages Generated by Complete Splicing Systems and Pure Unitary Languages

Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA. Some unanswered questions are related to the computational power of such systems, and finding a characterization of the class of circular languages generated by circular splicing systems is still an open problem. In this paper we solve this problem for c...

متن کامل

Splicing Languages Generated with One Sided Context

The splicing system concept was created in 1987 to allow the convenient representation in formal language theoretic terms of recombinant actions of certain sets of enzymes on double stranded DNA molecules. Characterizations are given here for those regular languages that are generated by splicing systems having splicing rules that test context on only one side. An algorithm is given for decidin...

متن کامل

On Derivation Languages of Flat Splicing Systems

In this work, we associate the idea of derivation languages with flat splicing systems and compare the languages generated as derivation languages (Szilard and Control languages) with the family of languages in Chomsky hierarchy. We show that there exist regular languages which cannot be generated as a Szilard language by any labeled flat splicing system. But some context-sensitive languages ca...

متن کامل

Optimal Proof Systems and Complete Languages

We investigate the connection between optimal propositional proof systems and complete languages for promise classes. We prove that an optimal propositional proof system exists if and only if there exists a propositional proof system in which every promise class with the test set in co-NP is representable. Additionally, we prove that there exists a complete language for UP if and only if there ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science

سال: 2009

ISSN: 2075-2180

DOI: 10.4204/eptcs.9.3